minimum cost path meaning in Chinese
最低成本路径
Examples
- After analysis of existing heuristic , four new heuristics for solve steiner problem which are kbmph ( key - node based minimum cost paths heuristic ) algorithm , kbmph , algorithm , kddmc ( key - node and destination driven multicast routing ) algorithm and wddmc ( weighted destination driven multicast routing ) algorithm are presented
在分析比较了已有的典型的启发式算法基础上，提出了四种steiner树的启发式算法： kbmph算法、 kbmph _ 1算法、 kddmc算法和wddmc算法。 - One of constrained problem is delay constrained steiner tree problem . a heuristic dbma ( delay - bounded multicast routing algorithm ) based on minimum delay path set and minimum cost path set is proposed . simulation result demonstrate that it is a delay constrained algorithm with low time complexity and low cost
首先是时延约束的最小steiner树问题，在比较了现有的算法以后，提出了一种基于最短时延路径集和最小费用路径集的多播路由算法? ? dbma算法，仿真结果表明该算法是一种低复杂度的时延约束低费用多播路由算法。 - The delay and delay variation constrained minimum steiner tree problem is also researched . lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem . low time complexity , low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
对于时延和时延差约束的最小steiner树问题，提出了一种基于最小时延路径和最小费用路径的算法?一lcdvma算法，由于该算法比较了通过中转节点后的最低费用路径和最短时延路径，降低了运算复杂度，通过仿真得到了较小的网络费用和时延差，因此lcdvma算法是一种具有低复杂度的时延和时延差约束的最小steiner树的启发式算法。